Computing sum of squares decompositions with rational coefficients
نویسندگان
چکیده
منابع مشابه
Computing sum of squares decompositions with rational coefficients
Sum of squares (SOS) decompositions for nonnegative polynomials are usually computed numerically, using convex optimization solvers. Although the underlying floating point methods in principle allow for numerical approximations of arbitrary precision, the computed solutions will never be exact. In many applications such as geometric theorem proving, it is of interest to obtain solutions that ca...
متن کاملAlgorithms for Computing Exact Sum of Squares Decompositions
Research Context. Certification and validation of computational results is a major issue for modern sciences raising challenging problems at the interplay of mathematics and computational aspects of computer science. One can emphasize in this context several applications arising in the design of modern cyber-physical systems with a crucial need of exact certification. In particular, one tries t...
متن کاملAlgorithms for Computing Exact Sum of Squares Decompositions
Research Context. Certification and validation of computational results is a major issue for modern sciences raising challenging problems at the interplay of mathematics and computational aspects of computer science. One can emphasize in this context several applications arising in the design of modern cyber-physical systems with a crucial need of exact certification. In particular, one tries t...
متن کاملGlobalAncova with Special Sum of Squares Decompositions
1 Abstract This vignette shows the enhancements made for GlobalAncova. Basically, there are four ideas implemented: decomposition of the sum of squares of a linear model ([2]) a plotting function for the sequential decomposition pairwise comparison for factor levels adjustment for global covariates The decomposition of the model sum of squares results in an ANOVA table, which shows the ...
متن کاملSums of Squares of Polynomials with Rational Coefficients
We construct families of explicit polynomials f over Q that are sums of squares of polynomials over R, but not over Q. Whether or not such examples exist was an open question originally raised by Sturmfels. We also study representations of f as sums of squares of rational functions over Q. In the case of ternary quartics, we prove that our counterexamples to Sturmfels’ question are the only ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.09.025